Computational barriers in minimax submatrix detection
نویسندگان
چکیده
منابع مشابه
Computational Barriers in Minimax Submatrix Detection
This paper studies the minimax detection of a small submatrix of elevated mean in a p× p matrix contaminated by additive Gaussian noise where p tends to infinity. To investigate the tradeoff between statistical performance and computational cost from a complexity-theoretic perspective, we consider a sequence of discretized models which are asymptotically equivalent in the sense of Le Cam. Under...
متن کاملMinimax robust decentralized detection
Decentralized detection problems are studied where the sensor distributions are not specified completely. The sensor distributions are assumed to belong to known uncertainty classes. It is shown for a broad class of such problems that a set of least favorable distributions exists for minimax robust testing between the hypotheses. It is hence established that the corresponding minimax robust tes...
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملComputational modeling of biological barriers
One of the most important aspects for all life on this planet is the act to keep their biological processes in a state where they do not reach equilibrium. One part in the upholding of this imbalanced state is the barrier between the cells and their surroundings, created by the cell membrane. Additionally, terrestrial animal life often requires a barrier that protects the organism’s body from e...
متن کاملComputational and Statistical Boundaries for Submatrix Localization in a Large Noisy
We study in this paper computational and statistical boundaries for submatrix localization. Given one observation of (one or multiple non-overlapping) signal submatrix (of magnitude λ and size km×kn) embedded in a large noise matrix (of size m × n), the goal is to optimal identify the support of the signal submatrix computationally and statistically. Two transition thresholds for the signal to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2015
ISSN: 0090-5364
DOI: 10.1214/14-aos1300